Improved di-neutron cluster model forHe6scattering
نویسندگان
چکیده
منابع مشابه
Di erential Cluster Analysis ?
We propose a new technique called Di erential Cluster Analysis for side-channel key recovery attacks. This technique uses cluster analysis to detect internal collisions and it combines features from previously known collision attacks and Di erential Power Analysis. It captures more general leakage features and can be applied to algorithmic collisions as well as implementation speci c collisions...
متن کاملAn Improved Model for Gene Cluster Inference
Inferring functionally related genes in microbial genomes is an important problem, which has been addressed by various gene cluster detection methods. Existing models well capture genomic inversions, gene duplications and insertions across a pair of genomic regions. Clusters involving multiple regions are indirectly inferred through constituent pairs. In this paper, we improve upon current work...
متن کاملDi - neutron correlation in light neutron - rich nuclei
Using a three-body model with density-dependent contact interaction, we discuss the root mean square distance between the two valence neutrons in Li nuclues as a function of the center of mass of the neutrons relative to the core nucleus Li. We show that the mean distance takes a pronounced minimum around the surface of the nucleus, indicating a strong surface di-neutron correlation. We demonst...
متن کاملCluster-Driven Model for Improved Word and Text Embedding
Most of the existing word embedding models only consider the relationships between words and their local contexts (e.g. ten words around the target word). However, information beyond local contexts (global contexts), which reflect the rich semantic meanings of words, are usually ignored. In this paper, we present a general framework for utilizing global information to learn word and text repres...
متن کاملImproved Algorithms for the Random Cluster Graph Model
The following probabilistic process models the generation of noisy clustering data: Clusters correspond to disjoint sets of vertices in a graph. Each two vertices from the same set are connected by an edge with probability p, and each two vertices from different sets are connected by an edge with probability r < p. The goal of the clustering problem is to reconstruct the clusters from the graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review C
سال: 2007
ISSN: 0556-2813,1089-490X
DOI: 10.1103/physrevc.75.064607